Nonstationary Relaxed Multisplitting Methods for Solving Linear Complementarity Problems with H-Matrices
نویسندگان
چکیده
منابع مشابه
Nonstationary Relaxed Multisplitting Methods for Solving Linear Complementarity Problems with H−matrices
In this paper we consider some non stationary relaxed synchronous and asynchronous multisplitting methods for solving the linear complementarity problems with their coefficient matrices being H−matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests.
متن کاملModulus-based synchronous multisplitting iteration methods for linear complementarity problems
To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based synchronous multisplitting iteration method and the corresponding symmetric modulus-based multisplitting relaxation methods. The convergence theorems are established when the system matrix is an H+-matrix, which improve the existing converg...
متن کاملA multiplicative multisplitting method for solving the linear complementarity problem
The convergence of the multiplicative multisplitting-type method for solving the linear complementarity problem with an H-matrix is discussed using classical and new results from the theory of splitting. This directly results in a sufficient condition for guaranteeing the convergence of the multiplicative multisplitting method. Moreover, the multiplicative multisplitting method is applied to th...
متن کاملA multisplitting method for symmetric linear complementarity problems
Over the years, many methods for solving the linear complementarity problem (LCP) have been developed. Most of these methods have their origin in solving a system of linear equations. In particular, much attention has recently been paid on the class of iterative methods called the splitting method, which is an extension of the matrix splitting method for solving a system of linear equations suc...
متن کاملEnclosing Solutions of Linear Complementarity Problems for H-Matrices
The paper establishes a computational encIosure of the solution of the linear complementarity problem (q, M), where M is assumed to be an H-matrix with a positive main diagonal. A dass of problems with interval data, which can arise in approximating the solutions of free boundary problems, is also treated successfully.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Computational Science & Applications
سال: 2018
ISSN: 2200-0011
DOI: 10.5121/ijcsa.2018.8101